Deterministic Routing of -relations on the Multibutterfly
نویسنده
چکیده
In this paper we devise an optimal deterministic algorithm for routing -relations on-line on an -input/output multibutterfly. The algorithm, which is obtained by generalizing the circuit-switching techniques of [3], routes any -relation with messages of bits, in log steps in the bit model, and in log log communication steps in the word model. Unlike other recently developed algorithms, our algorithm does not need extra levels of expanders, hence minimizes the layout area. Moreover, the network topology does not depend on .
منابع مشابه
Deterministic Routing of h-relations on the Multibutterfly
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N -input/output multibutterfly. The algorithm, which is obtained by generalizing the circuit-switching techniques of [3], routes any h-relation with messages of X bits in O h(X + logN ) steps in the bit model, and in O hdX= logNe + logN communication steps in the word model. Unlike other recently de...
متن کاملOn Analyzing the Cost of Communication in Networks
s of Talks Jean-Loup Baer On the Performance of Cluster Architectures Yosi Ben-Asher The Partitioned PRAM Model, Re-Doing Basic PRAM Algorithms with Limited Resources Artur Czumaj Adaptitive Allocation Processes Ralf Diekmann Load Balancing Strategies for Scientific Computing Applications Martin Dietzfelbinger On Analyzing the Cost of Communication in Networks Pierre Fraigniaud A General Theory...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملVehicle Routing Problem: Meta-heuristic Approaches
The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...
متن کامل